Maximum norm convergence of multigrid methods for elliptic boundary value problems
نویسنده
چکیده
We consider multigrid methods applied to standard linear finite element discretizations of linear elliptic boundary value problems in 2D. In the multigrid method damped Jacobi or damped Gauss-Seidel is used as a smoother. We prove that the two-grid method with v pre-smoothing iterations has a contraction number with respect to the maximum norm that is (asymptotically) bounded by Cv-~ I1n hkl 2 , with hk a suitable mesh size parameter. Moreover, it is shown that this bound is sharp in the sense that a factor lIn hkl is necessary.
منابع مشابه
Convergence of nonconforming V-cycle and F-cycle multigrid algorithms for second order elliptic boundary value problems
The convergence of V -cycle and F -cycle multigrid algorithms with a sufficiently large number of smoothing steps is established for nonconforming finite element methods for second order elliptic boundary value problems.
متن کاملIntroduction to Multigrid Methods for Elliptic Boundary Value Problems
We treat multigrid methods for the efficient iterative solution of discretized elliptic boundary value problems. Two model problems are the Poisson equation and the Stokes problem. For the discretization we use standard finite element spaces. After discretization one obtains a large sparse linear system of equations. We explain multigrid methods for the solution of these linear systems. The bas...
متن کاملNew Nonlinear Multigrid Analysis
SUMMARY The nonlinear multigrid is an eecient algorithm for solving the system of nonlinear equations arising from the numerical discretization of nonlinear elliptic boundary problems 7],,9]. In this paper, we present a new nonlinear multigrid analysis as an extension of the linear multigrid theory presented by Bramble, et al. in 5], 6], and 17]. In particular, we prove the convergence of the n...
متن کاملConvergence of the multigrid V-cycle algorithm for second-order boundary value problems without full elliptic regularity
The multigrid V -cycle algorithm using the Richardson relaxation scheme as the smoother is studied in this paper. For second-order elliptic boundary value problems, the contraction number of the V -cycle algorithm is shown to improve uniformly with the increase of the number of smoothing steps, without assuming full elliptic regularity. As a consequence, the V -cycle convergence result of Braes...
متن کاملAnalysis and Computation of Compatible
We develop and analyze least-squares finite element methods for two complementary div-curl elliptic boundary value problems. The first one prescribes the tangential component of the vector field on the boundary and is solved using curl-conforming elements. The second problem specifies the normal component of the vector field and is handled by div-conforming elements. We prove that both least-sq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2018